Routing through a dense channel with minimum total wire lengthFORMANN, M; WAGNER, D; WAGNER, F et al.Journal of algorithms (Print). 1993, Vol 15, Num 2, pp 267-283, issn 0196-6774Article

Reduced crossbar switch with minimum number of switching cellsOBARA, H.Electronics Letters. 2008, Vol 44, Num 14, pp 888-889, issn 0013-5194, 2 p.Article

Genetic algorithm based OSPF network routing using LEDATANG, Lenny; WIESE, Kay; KUMAR, Vive et al.Lecture notes in computer science. 2004, pp 571-572, issn 0302-9743, isbn 3-540-22004-6, 2 p.Conference Paper

Compact routing in directed networks with stretch factor of twoCHANDRA, Punit; KSHEMKALYANI, Ajay D.Lecture notes in computer science. 2001, pp 24-35, issn 0302-9743, isbn 3-540-43009-1Conference Paper

Rearrangeable circuit-switched hypercube architectures for routing permutationsSANG BANG CHOI; SOMANI, A. K.Journal of parallel and distributed computing (Print). 1993, Vol 19, Num 2, pp 125-130, issn 0743-7315Article

Self-routing algorithms for strongly regular multistage interconnection networksSENGUPTA, A; ZEMOUDEH, K; BANDYOPADHYAY, S et al.Journal of parallel and distributed computing (Print). 1992, Vol 14, Num 2, pp 187-192, issn 0743-7315Article

Blueline: A distributed Bluetooth scatternet formation and routing algorithm : Computer and communication networksCHANG, Ruay-Shiung; CHOU, Ming-Te.Journal of information science and engineering. 2005, Vol 21, Num 3, pp 479-494, issn 1016-2364, 16 p.Article

A heuristic routing algorithm for shared protection in connection-oriented networksSHENGLI YUAN; JUE, Jason.SPIE proceedings series. 2001, pp 142-152, isbn 0-8194-4331-XConference Paper

A new intuitional algorithm for solving heterogeneous fixed fleet routing problems : Passenger pickup algorithmGENCER, Cevriye; TOP, Ismail; AYDOGAN, Emel Kizilkaya et al.Applied mathematics and computation. 2006, Vol 181, Num 2, pp 1552-1567, issn 0096-3003, 16 p.Article

Structural information and communication complexityPELEG, David; SIBEYN, Jop.Theoretical computer science. 2005, Vol 333, Num 3, issn 0304-3975, 128 p.Conference Proceedings

Routing algorithms for DHTs: Some open questionsRATUASAINY, Sylvia; STOICA, Ion; SHENKER, Scott et al.Lecture notes in computer science. 2002, pp 45-52, issn 0302-9743, isbn 3-540-44179-4, 8 p.Conference Paper

Architectural improvements for a Data-Driven VLSI processing arrayWEISS, S; SPILLINGER, I. Y; SILBERMAN, G. M et al.Journal of parallel and distributed computing (Print). 1993, Vol 19, Num 4, pp 308-322, issn 0743-7315Article

An effective approach to the enhancement of incomplete hypercube computersNIAN-FENG TZENG; HSING-LUNG CHEN.Journal of parallel and distributed computing (Print). 1992, Vol 14, Num 2, pp 163-174, issn 0743-7315Article

An oblivious shortest-path routing algorithm for fully connected cubic networksXIAOFAN YANG; MEGSON, Graham M; EVANS, David J et al.Journal of parallel and distributed computing (Print). 2006, Vol 66, Num 10, pp 1294-1303, issn 0743-7315, 10 p.Article

Could any graph be turned into a small-world?DUCHON, Philippe; HANUSSE, Nicolas; LEBHAR, Emmanuelle et al.Theoretical computer science. 2006, Vol 355, Num 1, pp 96-103, issn 0304-3975, 8 p.Article

Close to optimal decentralized routing in long-range contact networksLEBHAR, Emmanuelle; SCHABANEL, Nicolas.Theoretical computer science. 2005, Vol 348, Num 2-3, pp 294-310, issn 0304-3975, 17 p.Conference Paper

A Dynamic Routing Algorithm for Multi-Domain Photonic Networks using Averaged Link Load InformationSHIMADA, Kohei; ARAKI, Soichiro; HASEGAWA, Hiroshi et al.Proceedings of SPIE, the International Society for Optical Engineering. 2009, Vol 7633, issn 0277-786X, isbn 978-0-8194-8035-4 0-8194-8035-5, 1Vol, 76331F.1-76331F.5Conference Paper

An Edge Ordering Problem of Regular HypergraphsHONGBING FAN; KALBFLEISCH, Robert.Lecture notes in computer science. 2006, pp 368-377, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

The full-cube topology: properties and routingSIBAI, F. N; ABONAMAH, A.Information sciences. 1994, Vol 76, Num 1-2, pp 111-129, issn 0020-0255Article

Optical Path Dynamic Routing Algorithm based on Traffic PredictionOBARA, Keita; HASEGAWA, Hiroshi; SATO, Ken-Ichi et al.Proceedings of SPIE, the International Society for Optical Engineering. 2008, Vol 7137, issn 0277-786X, isbn 9780819473776, Part II, 713724.1-713724.5, 2Conference Paper

A limited path unicast QoS routing algorithmYANXING ZHENG; JING TIAN; ZHIFENG LIU et al.IEEE symposium on computers communications. 2004, isbn 0-7803-8623-X, 2Vol, vol2, 870-875Conference Paper

A list based threshold accepting algorithm for the capacitated vehicle routing problemTARANTILIS, C. D; KIRANOUDIS, C. T; VASSILIADIS, V. S et al.International journal of computer mathematics. 2002, Vol 79, Num 5, pp 537-553, issn 0020-7160Article

A method for data allocation and manipulation in Hypercube computersABOELAZE, M; LEE, D.-L.Parallel computing. 1993, Vol 19, Num 5, pp 497-510, issn 0167-8191Article

An algorithm for node-capacitated ring routingFRANK, Andras; KIRALY, Zoltan; KOTNYEK, Balazs et al.Lecture notes in computer science. 2005, pp 249-258, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 10 p.Conference Paper

A genetic routing algorithm for a 2D-meshed fault-tolerant network systemSANGMOON LEE; DAEKEUN MOON; HAGBAE KIM et al.Lecture notes in computer science. 2002, pp 39-46, issn 0302-9743, isbn 3-540-43968-4, 8 p.Conference Paper